Adversary Games in Secure/Reliable Network Routing

In this paper, we consider security aspects of network routing in a game-theoretic framework where an attacker is empowered with an ability for intrusion into edges of the network; on the other hand, the goal of designer is to choose routing paths. We interpret the secure routing problem as a two player zero sum game. The attacker can choose one or more edges for intrusion, while the designer has to choose paths between source-destination pairs for a given set of pairs. We give polynomial-time algorithms for finding mixed Nash equilibria if 1) the attacker is limited to a one-edge attack, 2) the designer has two source-destination pairs while the attacker is either limited to c edges, for given c, or the attacker incurs a cost for each edge attacked. Previous work gave an algorithm for one source-destination pair and multiple edge attacks.